A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Wireless communications play a critical role in the applications of Internet Things (IoT). The Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) is well-proven wireless random access protocol. A crucial factor affecting performance networks “hidden node collision,” which incurs degradation and lower resource utilization. Grouping an efficient strategy for hidden avoidance. In current IoT networks, terminals usually have different traffic load, so load balance should be considered when grouping algorithm designed. To mitigate nodes achieve simultaneously, we propose based on game theory. By introducing supermartingale theory, delay completed groups analyzed. Simulations prove that proposed alleviates collision, balances traffic, promotes guarantee Quality Service (QoS).